Higman ’ s Embedding Theorem . An Elementary Proof
نویسنده
چکیده
In 1961 G. Higman proved a remarkable theorem establishing a deep connection between the logical notion of recursiveness and questions about finitely presented groups. The basic aim of the present paper is to provide the reader with a rigorous and detailed proof of Higman’s Theorem. All the necessary preliminary material, including elements of group theory and recursive functions theory, is systematically presented and with complete proofs. The aquainted reader may skip the first sections and proceed immediately to the last.
منابع مشابه
A Remark on the Higman-neumann-neumann Embedding Theorem
There does not exist an isomorphism-invariant Borel version of the Higman-Neumann-Neumann Embedding Theorem.
متن کاملAnother proof of Banaschewski's surjection theorem
We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملFinitely generated lattice-ordered groups with soluble word problem
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for lattice-ordered groups: Theorem: A finitely generated lattice-ordered group has soluble word problem if and only if it can be `-embedded in an `-simple lattice-or...
متن کاملA new proof of a result of Higman
Given two strings x, y ∈ Σ∗, say that x is a subsequence of y (denoted x y) if x results from removing zero or more characters from y. For a language L ⊆ Σ∗, define SUBSEQ(L) to be the set of all subsequences of strings in L. We give a new proof of a result of Higman, which states, If L is any language over a finite alphabet, then SUBSEQ(L) is regular. Higman’s original proof makes use of the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995